A pr 2 00 9 On a Diophantine problem with two primes and s powers of two
نویسندگان
چکیده
We refine a recent result of Parsell [20] on the values of the form λ 1 p 1 + λ 2 p 2 + µ 1 2 m 1 + · · · + µ s 2 m s , where p 1 , p 2 are prime numbers, m 1 ,. .. , m s are positive integers, λ 1 /λ 2 is negative and irrational and λ 1 /µ 1 , λ 2 /µ 2 ∈ Q.
منابع مشابه
2 N ov 2 00 8 On a Diophantine problem with two primes and s powers of two
We refine a recent result of Parsell [22] on the values of the form λ 1 p 1 + λ 2 p 2 + µ 1 2 m 1 + · · · + µ s 2 m s , where p 1 , p 2 are prime numbers, m 1 ,. .. , m s are positive integers, λ 1 /λ 2 is negative and irrational and λ 1 /µ 1 , λ 2 /µ 2 ∈ Q.
متن کاملA NEW PROOF OF THE PERSISTENCE PROPERTY FOR IDEALS IN DEDEKIND RINGS AND PR¨UFER DOMAINS
In this paper, by using elementary tools of commutative algebra,we prove the persistence property for two especial classes of rings. In fact, thispaper has two main sections. In the first main section, we let R be a Dedekindring and I be a proper ideal of R. We prove that if I1, . . . , In are non-zeroproper ideals of R, then Ass1(Ik11 . . . Iknn ) = Ass1(Ik11 ) [ · · · [ Ass1(Iknn )for all k1,...
متن کاملDiophantine approximation with primes and powers of two
We investigate the values taken by real linear combinations of two primes and a bounded number of powers of two. Under certain conditions, we are able to demonstrate that these values can be made arbitrarily close to any real number by taking sufficiently many powers of two.
متن کاملA problem of Diophantus and Dickson’s conjecture
A Diophantine m-tuple with the property D(n), where n is an integer, is defined as a set of m positive integers with the property that the product of its any two distinct elements increased by n is a perfect square. It is known that if n is of the form 4k + 2, then there does not exist a Diophantine quadruple with the property D(n). The author has formerly proved that if n is not of the form 4k...
متن کاملAlmost powers in the Lucas sequence
The famous problem of determining all perfect powers in the Fibonacci sequence (Fn)n≥0 and in the Lucas sequence (Ln)n≥0 has recently been resolved [10]. The proofs of those results combine modular techniques from Wiles’ proof of Fermat’s Last Theorem with classical techniques from Baker’s theory and Diophantine approximation. In this paper, we solve the Diophantine equations Ln = qy, with a > ...
متن کامل